Searching questions based on topic and focus

ABSTRACT

A method and system for determining the relevance of questions to a queried question based on topics and focuses of the questions is provided. A question search system provides a collection of questions with topics and focuses. Upon receiving a queried question, the question search system identifies a queried topic and queried focus of the queried question. The question search system generates a score indicating the relevance of a question of the collection to the queried question based on a language model of the topic of the question and a language model of the focus of the question.

CROSS-REFERENCE TO RELATED APPLICATION

This application relates to U.S. patent application Ser. No. 12/185,702,filed on Aug. 4, 2008, entitled “CLUSTERING QUESTION SEARCH RESULTSBASED ON TOPIC AND FOCUS,” which is hereby incorporated by reference inits entirety.

BACKGROUND

Many search engine services, such as Google and Live Search, provide forsearching for information that is accessible via the Internet. Thesesearch engine services allow users to search for display pages, such asweb pages, that may be of interest to users. After a user submits asearch request (i.e., a query) that includes search terms, the searchengine service identifies web pages that may be related to those searchterms. To quickly identify related web pages, the search engine servicesmay maintain a mapping of keywords to web pages. This mapping may begenerated by “crawling” the web (i.e., the World Wide Web) to identifythe keywords of each web page. To crawl the web, a search engine servicemay use a list of root web pages to identify all web pages that areaccessible through those root web pages. The keywords of any particularweb page can be identified using various well-known informationretrieval techniques, such as identifying the words of a headline, thewords supplied in the metadata of the web page, the words that arehighlighted, and so on. The search engine service may generate arelevance score to indicate how relevant the information of the web pagemay be to the search request based on the closeness of each match, webpage importance or popularity (e.g., Google's PageRank), and so on. Thesearch engine service then displays to the user links to those web pagesin an order that is based on a ranking that may be determined by theirrelevance, popularity, or some other measure.

Some online services, such as Yahoo! Answers and Live Search QnA, havecreated large collections of questions and their corresponding answers.These Q&A services may provide traditional frequently asked question(“FAQ”) services or may provide community-based services in whichmembers of the community contribute both questions and answers to thosequestions. These Q&A services provide a mechanism that allows users tosearch for previously generated answers to previously posed questions.These Q&A services typically input a queried question from a user,identify questions of the collection that relate to the queried question(i.e., a question search), and return the answers to the identifiedquestions as the answer to the queried question.

Such Q&A services typically treat the questions as plain text. The Q&Aservices may use various techniques, including a vector space model anda language model, when performing a question search. Table 1 illustratesexample results of a question search for a queried question.

TABLE 1 Queried Question: Q1: Any cool clubs in Berlin or Hamburg?Expected Question Q2: What are the best/most fun clubs in Berlin? NotExpected Question: Q3: Any nice hotels in Berlin or Hamburg? Q4: Howlong does it take to get to Hamburg from Berlin? Q5: Cheap hotels inBerlin?Such Q&A services may identify questions Q2, Q3, Q4, and Q5 as beingrelated to queried Question Q1. The Q&A services typically cannotdetermine, however, which identified question is most related to thequeried question. In this example, question Q2 is most closely relatedto queried question Q1.

SUMMARY

A method and system for determining the relevance of questions to aqueried question based on topics and focuses of the questions isprovided. A question search system provides a collection of questionswith topics and focuses. The topic of a question represents the majorcontext/constraint of a question that characterizes the interest of theuser who submits the question. The focus of a question representscertain aspects or descriptive features of the topic of the question inwhich the user is interested. Upon receiving a queried question, thequestion search system identifies a queried topic and queried focus ofthe queried question. The question search system generates a scoreindicating the relevance of a question of the collection to the queriedquestion based on a language model of the topic of the question and alanguage model of the focus of the question.

This Summary is provided to introduce a selection of concepts in asimplified form that are further described below in the DetailedDescription. This Summary is not intended to identify key features oressential features of the claimed subject matter, nor is it intended tobe used as an aid in determining the scope of the claimed subjectmatter.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram that illustrates an example question tree.

FIG. 2 is a block diagram illustrating components of a question searchsystem in some embodiments.

FIG. 3 is a flow diagram that illustrates the processing of a search foranswers component of the question search system in some embodiments.

FIG. 4 is a flow diagram that illustrates the processing of a search fordocuments components of the question search system in some embodiments.

FIG. 5 is a flow diagram that illustrates the processing of the searchfor questions component of the question search system in someembodiments.

FIG. 6 is a flow diagram that illustrates the processing of a calculatescore for topic component of the question search system in someembodiments.

FIG. 7 is a flow diagram that illustrates the processing of a generatetopic-by-term probability matrix component of the question search systemin some embodiments.

FIG. 8 is a flow diagram that illustrates the processing of a generatetopic-by-term count matrix component of the question search system insome embodiments.

FIG. 9 is a block diagram of a computing device on which the questionsearch system may be implemented.

DETAILED DESCRIPTION

A method and system for determining the relevance of questions to aqueried question based on topics and focuses of the questions isprovided. In some embodiments, a question search system provides acollection of questions. Each question of the collection has anassociated topic and focus. The topic of a question represents the majorcontext/constraint of a question that characterizes the interest of theuser who submits the question. For example, the question “Any cool clubsin Berlin or Hamburg?” has the topic of “Berlin Hamburg” (removing stopwords). The focus of a question represents certain aspects ordescriptive features of the topic of the question in which the user isinterested. For example, the sample question has the focus of “coolclubs,” which describes, refines, or narrows the user's interest in thetopic of the question. Upon receiving a queried question, the questionsearch system identifies a queried topic and queried focus of thequeried question. The question search system generates a scoreindicating the relevance of a question of the collection to the queriedquestion based on a language model of the topic of the question and alanguage model of the focus of the question. The question search systemmay generate a score for each question or a subset of questions in thecollection, and the question with the highest score may be considered tobe the most relevant question to the queried question. The determinationof the relevance of a question to a queried question may be used in Q&Asearching and may be used in document searching such as by a web searchservice that searches for web pages.

In some embodiments, the question search system identifies the topicsand focuses of a collection of questions using a minimum descriptionlength (“MDL”) tree cut model. Such identification of topics and focusesis described in U.S. patent application Ser. No. 12/098,457, entitled“Recommending Questions to Users of Community Question Answering,” andfiled on Apr. 7, 2008 which is hereby incorporated by reference. A “cut”of a tree is any set of nodes in the tree that defines the partition ofall nodes viewing each node as representing a set of its child nodes aswell as itself. The question search system generates a “question tree”for questions of the collection by identifying base noun phrases andWH-ngrams of the question. A base noun phrase is a simple andnon-recursive noun phrase, and a WH-ngram is an n-gram beginning withthe WH-words: when, what, where, which, and how. The question searchsystem calculates the specificity of a term (e.g., base noun phrase orWH-word) to indicate how well the term characterizes the informationneeds of users who posts a question. The question search system thengenerates a topic chain for each question, which is a list of the termsof a question ordered from highest to lowest specificity. For example,the topic chain of the question “Any cool clubs in Berlin or Hamburg?”may be “Hamburg→Berlin→cool club” because the specificity for Hamburg,Berlin, and cool club may be 0.99, 0.62, and 0.36, respectively. Thetopic chains for the questions of Table 1 are illustrated in Table 2.

TABLE 2 Queried Question: Q1: Hamburg→Berlin→cool club Expected QuestionQ2: Berlin→fun club Not Expected Question: Q3: Hamburg→Berlin→nice hotelQ4: Hamburg→Berlin→how long does it take Q5: Berlin→cheap hotels

FIG. 1 is a diagram that illustrates an example question tree. Aquestion tree 100 represents the topic chains of Table 2. The connectednodes of Hamburg, Berlin, and cool club represent the topic chain of“Hamburg→Berlin→cool club.” The cut of the question tree is representedby a dashed line 101. The terms before (to the left of) the cutrepresent the topics, and the terms after (to the right on the cutrepresent the focuses. The topic of the question “Any cool clubs inBerlin or Hamburg?” is thus “Hamburg Berlin,” and focus of that questionis “cool club.”

The question search system represents the relevance of a question {tildeover (q)} to a queried question q by the probability p(q|{tilde over(q)}) of generating the queried question q from a language model formedby the question {tilde over (q)}. The question {tilde over (q)} is froma collection C of questions. The probability is a score indicating therelevance of the question {tilde over (q)} to the queried question q.The question search system may represent the probability with thefollowing equation:

$\begin{matrix}{{p( {q❘\overset{\sim}{q}} )} = {{\lambda \cdot {p( {{T(q)}❘{T( \overset{\sim}{q} )}} )}} + {( {1 - \lambda} ) \cdot {p( {{F(q)}❘{F( \overset{\sim}{q} )}} )}}}} & (1)\end{matrix}$where p(T(q)|T({tilde over (q)})) represents a topic probability ofgenerating terms of the queried topic T(q) from a language model of thetopic T({tilde over (q)}), p(F(q)|F({tilde over (q)})) represents afocus probability of generating terms of the queried focus F(q) from alanguage model of the focus F({tilde over (q)}), and λ represents aweight for a weighted linear combination of the topic probability andthe focus probability. One skilled in the art will appreciate that thetopic probability and the focus probability may alternatively becombined in a non-linear manner.

The question search system uses traditional language modeling torepresent a single multinomial model p(t|{tilde over (q)}) over terms tthat are estimated for each question {tilde over (q)}. The questionsystem uses two such multinomial models p(t|T({tilde over (q)})) andp(t|F({tilde over (q)})) to estimate the topic probability and focusprobability for each question {tilde over (q)}. In some embodiments, thequestion search system may use a unigram language model. However, abi-gram, tri-gram, or more generally an n-gram language model may beused. The question search system represents Equation 1 using a unigramlanguage model with the following equation:

$\begin{matrix}{{p( {q❘\overset{\sim}{q}} )} = {{\lambda \cdot {\prod\limits_{t \in {T{(q)}}}{p( {t❘{T( \overset{\sim}{q} )}} )}}} + {( {1 - \lambda} ) \cdot {\prod\limits_{t \in {F{(q)}}}{p( {t❘{F( \overset{\sim}{q} )}} )}}}}} & (2)\end{matrix}$

To avoid zero probabilities and to estimate more accurate languagemodels, the question search system may smooth out the topics and focusesof questions using a language model based on the entire collection ofquestions. The question search system represents the smoothed-outprobabilities with the following equations:

$\begin{matrix}{{p( {t❘{H( \overset{\sim}{q} )}} )} = {{\alpha \cdot {\hat{p}( {t❘{T( \overset{\sim}{q} )}} )}} + {( {1 - \alpha} ) \cdot {\hat{p}( {t❘C} )}}}} & (3)\end{matrix}$

$\begin{matrix}{{p( {t❘{T( \overset{\sim}{q} )}} )} = {{\beta \cdot {\hat{p}( {t❘{F( \overset{\sim}{q} )}} )}} + {( {1 - \beta} ) \cdot {\hat{p}( {t❘C} )}}}} & (4)\end{matrix}$where {circumflex over (p)}(t|T({tilde over (q)})), {circumflex over(p)}(t|F({tilde over (q)})), and {circumflex over (p)}(t|C) are maximumlikelihood estimation (“MLE”) estimators with respect to the topic ofquestion {tilde over (q)}, the focus of question {tilde over (q)}, andthe collection (or corpus) C and where α and β represents weights for alinear combination of the terms of the equations.

The question search system also attempts to account for the “lexicalchasm” between questions. A “lexical chasm” occurs when two questionsthat have the same meaning use very different wording. For example, thequestions “where to stay in Hamburg?” and “the best hotel in Hamburg?”have almost the same meaning but are lexically different in their focus.The focus “where to stay” has no word in common with the focus “besthotel.” A mixture model for fixing the lexical chasm between questionsis described in Jeon, J., and Croft, W. B., “Learning Translation-BasedLanguage Models using Q&A Archives,” Technical Report, University ofMassachusetts (2007). The model is a combination of the languagemodeling approach (for information retrieval) and the translation-basedapproach (for information retrieval).

The question search system may be extended to use a translation-basedmodel. The question search system would then represent Equations 3 and 4with the following equations:

$\begin{matrix}{{p( {t❘{T( \overset{\sim}{q} )}} )} = {{\alpha_{1} \cdot {\hat{p}( {t❘{T( \overset{\sim}{q} )}} )}} + {\alpha_{2} \cdot {\sum\limits_{t^{\prime} \in {T{(\overset{\_}{q})}}}{{{Tr}( {t❘t^{\prime}} )} \cdot {\hat{p}( {t^{\prime}❘{T( \overset{\sim}{q} )}} )}}}} + {( {1 - \alpha_{1} - \alpha_{2}} ) \cdot {\hat{p}( {t❘C} )}}}} & (5) \\{{p( {t❘{F( \overset{\sim}{q} )}} )} = {{\beta_{1} \cdot {\hat{p}( {t❘{F( \overset{\sim}{q} )}} )}} + {\beta_{2} \cdot {\sum\limits_{t^{\prime} \in {F{(\overset{\_}{q})}}}{{{Tr}( {t❘t^{\prime}} )} \cdot {\hat{p}( {t^{\prime}❘{F( \overset{\sim}{q} )}} )}}}} + {( {1 - \beta_{1} - \beta_{2}} ) \cdot {\hat{p}( {t❘C} )}}}} & (6)\end{matrix}$where Tr(t|t′) represents the probability that term t is the translationof t′. The question search system may estimate the probability Tr(t|t′)based on the collections of question titles and question descriptions asa parallel corpus and the IBM model 1 as the alignment model, asdescribed in Brown, P. F., Pietra, V. J. D., Pietra, S. A. D., andMercer R. L., “The Mathematics of Statistical Machine Translation:Parameter Estimation,” Computing Linguistics, 19(2):263-311 (1993).Conceptually, the question descriptions represent user reiterations orparaphrasings of the question titles. The alignment model is used toalign the question titles with words used in the question descriptions.

FIG. 2 is a block diagram illustrating components of a question searchsystem in some embodiments. A question search system 210 may beconnected to user computing devices 250, a search service 260, and a Q&Aservice 270 via a communication link 240. The question search systemincludes various data stores including a question/answer store 211, aquestion tree store 212, a cut question tree store 213, a topic-by-termprobability matrix store 214, a focus-by-term probability matrix store215 a parallel corpus store 216, and a translation probability store217. The question/answer store 211 contains questions and theircorresponding answers. The question tree store 212 contains a questiontree for the questions of the question/answer store. The cut questiontree store 213 indicates the cut of the question tree. The topic-by-termprobability matrix store 214 contains the probability of each term beinggenerated from a language model of the corresponding topic. Thefocus-by-term probability matrix store 215 contains the probability ofeach term being generated from a language model of the correspondingfocus. The parallel corpus store 216 contains question titles andquestion descriptions used to generate translation probabilities. Thetranslation probability store 217 contains the translation probabilitiesfor the terms in the parallel corpus.

The question search system 210 also includes a search for answerscomponent 221, a search for documents component 222, a search forquestions component 223, a calculate score for topic component 224, anda calculate score for focus component 225. The search for answerscomponent 221 identifies questions of the question/answer store 211 thatare relevant to a queried question and selects the answers correspondingto the identified questions as results for the queried question. Thesearch for documents component 222 identifies questions of thequestion/answer store 211 that are relevant to a queried question, usesthe identified questions to search for documents (e.g., web pages), anduses these search results as the search results for the queriedquestion. The search for questions component 223 calculatesprobabilities that the queried question can be generated by languagemodels of the questions of the question/answer store 211 based onlanguage models for the topics and focuses. The calculate score fortopic component 224 and the calculate score for focus component 225calculate probabilities for the topic and focus, respectively.

The question search system 210 also includes components to generateinitial probabilities such as a generate topic-by-term probabilitymatrix component 231, a generate topic-by-term count matrix component232, a generate focus-by-term probability matrix component 233, agenerate focus-by-term count matrix component 234, and a generatetranslation probability component 235. The generate topic-by-termprobability matrix component 231 generates the probabilities for thetopic-by-term probability matrix 214, by invoking the generatetopic-by-term count matrix component 232, to generate counts of theterms within the topics. The generate focus-by-term probability matrixcomponent 233 and the generate focus-by-term count matrix component 234function in an analogous manner to the corresponding topic components.The generate translation probability component 235 calculates theprobability of a term being a translation of another term based on thequestion titles and question descriptions in the parallel corpus store216.

FIG. 9 is a block diagram of a computing device on which the questionsearch system may be implemented. The computing device 900 on which thequestion search system 200 may be implemented may include a centralprocessing unit 901, memory 902, input devices 904 (e.g., keyboard andpointing devices), output devices 905 (e.g., display devices), andstorage devices 903 (e.g., disk drives). The memory and storage devicesare computer-readable media that may contain instructions that implementthe question search system. In addition, the data structures and messagestructures may be stored or transmitted via a data transmission medium,such as a signal on a communications link. Various communications linksmay be used, such as the Internet, a local area network, a wide areanetwork, or a point-to-point dial-up connection.

The question search system may be implemented in and/or used by variousoperating environments. The operating environment described herein isonly one example of a suitable operating environment and is not intendedto suggest any limitation as to the scope of use or functionality of therelevance system. Other well-known computing systems, environments, andconfigurations that may be suitable for use include personal computers,server computers, hand-held or laptop devices, multiprocessor systems,microprocessor-based systems, programmable consumer electronics, networkPCs, minicomputers, mainframe computers, distributed computingenvironments that include any of the above systems or devices, and thelike.

The question search system may be described in the general context ofcomputer-executable instructions, such as program modules, executed byone or more computers or other devices. Generally, program modulesinclude routines, programs, objects, components, data structures, etc.,that perform particular tasks or implement particular abstract datatypes. Typically, the functionality of the program modules may becombined or distributed as desired in various embodiments.

FIG. 3 is a flow diagram that illustrates the processing of a search foranswers component of the question search system in some embodiments. Thecomponent inputs a queried question, identifies questions of thequestion/answer store that are relevant to the queried question, andoutputs the answers to the identified questions as answers to thequeried question. In block 301, the component inputs the queriedquestion. In block 302, the component invokes the search for questionscomponent to search for questions that are relevant to the queriedquestion. In block 303, the component selects the answers for therelevant questions with the highest scores. In block 304, the componentoutputs the selected answers as answers to the queried question and thencompletes.

FIG. 4 is a flow diagram that illustrates the processing of a search fordocuments component of the question search system in some embodiments.The component identifies questions that are relevant to a queriedquestion and submits those questions to a search engine service thatgenerates results for the queried question. In block 401, the componentinputs a queried question. In block 402, the component optionallysearches for documents based on the queried question. In decision block403, if sufficient search results are returned, then the componentcontinues at block 407, or else the component continues at block 404. Inblock 404, component invokes the search for questions component toidentify questions relevant to the queried question. In block 405, thecomponent selects the question with the highest relevance score. Inblock 406, the component searches for documents with the selectedquestion. In block 407, the component outputs the documents as a searchresult for the queried question and then completes.

FIG. 5 is a flow diagram that illustrates the processing of the searchfor questions component of the question search system in someembodiments. The component is passed a queried question and returns theprobability scores for candidate questions. In block 501, the componentidentifies related questions as candidate questions. The component mayinitially use some techniques such as a vector space model to identify asubset of the questions of the question/answer store that may be relatedto the queried question. Alternatively, the component may identify allthe questions of the question/answer store as candidate questions. Inblock 502, the component adds the queried question to the question treefor the questions of the question/answer store and then generates a cutof the question tree. In blocks 503-507, the component loops,calculating the score for each candidate question. In block 503, thecomponent selects the next candidate question. In decision block 504, ifall the candidate questions have already been selected, then thecomponent returns the scores and the candidate questions, or else thecomponent continues at block 505. In block 505, the component calculatesthe score for the topic by invoking the calculate score for topiccomponent. In block 506, the component calculates the score for thefocus by invoking the calculate score for focus component. In block 507,the component combines the score of the topic and focus as a score forthe selected candidate question. The component then loops to block 503to select the next candidate question.

FIG. 6 is a flow diagram that illustrates the processing of a calculatescore for topic component of the question search system in someembodiments. The component is passed a queried question and a candidatequestion and calculates a corresponding topic probability. (The questionsearch system also includes a component to calculate a score for acorresponding focus probability in a similar manner.) In block 601, thecomponent retrieves the queried topic of the queried question. In block602, the component initializes the score for the topic probability. Inblocks 603-606, the component loops, aggregating the probabilities forterms of the queried question. In block 603, the component selects thenext term of the queried topic. In decision block 604, if all the termshave already been selected, then the component returns the score, orelse the component continues at block 605. In block 605, the componentretrieves a probability for the selected term from the topic-by-termprobability matrix, which may be smoothed by using a corpus-by-termprobability. In block 606, the component multiplies the score by theretrieved probability to give the new aggregated score and then loops toblock 603 to select the next term of the queried topic.

FIG. 7 is a flow diagram that illustrates the processing of a generatetopic-by-term probability matrix component of the question search systemin some embodiments. The component generates a probability that eachterm can be generated by a language model of each topic. The componentmay use a corpus-by-term probability to smooth the topic-by-termprobabilities. (The question search system also includes a componentthat generates a focus-by-term probability matrix in a similar manner.)In block 701, the component generates a question tree of the questionsof the question/answer store. In block 702, the component generates acut for the question tree. In block 703, the component invokes thegenerate topic-by-term count matrix to count the occurrences of a termwithin the topics. In blocks 704-709, the component loops, convertingthe counts to probabilities. In block 704, the component selects thenext term. In decision block 705, if all the terms have already beenselected, then the component completes, or else the component continuesat block 706. In block 706, the component calculates the total count forthe selected term. In block 707, the component selects the next topicwith a nonzero count for the selected term. In decision block 708, ifall such topics have already been selected, then the component loops toblock 704 to select the next term, or else the component continues atblock 709. In block 709, the component calculates the probability forthe selected term and the selected topic by dividing the count by thetotal count. The component then loops to block 707 to select the nexttopic with a nonzero count.

FIG. 8 is a flow diagram that illustrates the processing of a generatetopic-by-term count matrix component of the question search system insome embodiments. The component is passed a cut of the question tree andgenerates a topic-by-term count matrix. In block 801, the componentselects the next question. In decision block 802, if all the questionshave already been selected, then the component returns to the countmatrix, or else the component continues at block 803. In block 803, thecomponent selects the next term of the topic of the selected question.In decision block 804, if all such terms have already been selected,then the component loops to block 801 to select the next question, orelse the component continues at block 805. In block 805, the componentdetermines the count for the topic of the selected question and theselected term and then loops to block 803 to select the next term.

Although the subject matter has been described in language specific tostructural features and/or methodological acts, it is to be understoodthat the subject matter defined in the appended claims is notnecessarily limited to the specific features or acts described above.Rather, the specific features and acts described above are disclosed asexample forms for implementing the claims. Accordingly, the invention isnot limited except as by the appended claims.

1. A method in a computing device for identifying questions relevant toa queried question, the method comprising: providing a collection ofquestions having terms, each question having a topic of one or moreterms of the question and a focus of one or more terms of the question;for each topic and for each term in the questions of the collection,calculating by the computing device a probability of generating thatterm from a language model of that topic; for each focus and for eachterm in the questions of the collection, calculating by the computingdevice a probability of generating that term from a language model ofthat focus; receiving a queried question having terms; identifying aqueried topic and a queried focus of the queried question; for each of aplurality of questions of the collection, calculating a topicprobability of the queried topic as a probability of generating theterms of the queried topic from a language model of the topic of thequestion; calculating a focus probability of the queried focus as aprobability of generating the terms of the queried focus from a languagemodel of the focus of the question; and generating the probability ofthe queried question from a language model of the question using thecalculated topic probability and the calculated focus probability of thequestion, the probability indicating the relevance of the question tothe queried question.
 2. The method of claim 1 wherein calculating ofthe probabilities is based on an n-gram language model.
 3. The method ofclaim 1 wherein the probability of the queried question is generatedfrom a weighted linear combination of the calculated topic probabilityand the calculated focus probability.
 4. The method of claim 1 whereincalculating the probabilities factors in the probability of the termsoccurring in the collection to account for sparseness of a term in thecollection.
 5. The method of claim 4 wherein the calculated topicprobability is a weighted linear combination of an estimated calculatedtopic probability and the probability of the terms occurring in thecollection.
 6. The method of claim 1 wherein the topics and focuses ofthe questions of the collection are identified by generating a questiontree of the questions of the collection and generating a cut of thequestion tree.
 7. The method of claim 6 wherein each question isrepresented by a term chain within the question tree, the topic of aquestion comprises the terms before the cut of the term chain, and thefocus of a question comprises the terms after the cut of the term chain.8. The method of claim 7 wherein the cut is based on minimum descriptionlength.
 9. The method of claim 1 wherein calculating the probabilitiesfactors in a translation probability that a term of the queried questionis a translation of a term of a question.
 10. The method of claim 9wherein the translation probability is generated from a collection ofquestions with associated descriptions of each collection.
 11. Acomputer-readable storage medium containing instructions for controllinga computing device to identify questions related to a queried question,by a method comprising: providing a collection of questions, eachquestion having terms, each term having a topic and a focus, the topicsand focuses of the questions of the collection are identified bygenerating a question tree of the questions of the collection andgenerating a cut of the question tree, a topic of a question comprisingthe terms of the question before the cut and the focus of a questioncomprising the terms of the question after the cut; for each topic andfor each term in the questions of the collection, calculating aprobability of generating that term from a language model of the topic;for each focus and for each term in the questions of the collection,calculating a probability of generating that term from a language modelof the focus; receiving a queried question having terms; identifying aqueried topic and a queried focus of the question; for each of aplurality of questions of the collection, calculating a topicprobability of the queried topic that factors in a probability ofgenerating the terms of the queried topic from a language model of thetopic of the question, a collection probability of the terms occurringin the collection to account for sparseness of a term in the collection,and a translation probability that a term of the queried question is atranslation of a term of a question; calculating a focus probability ofthe queried focus that factors in a probability of generating the termsof the queried focus from a language model of the focus of the question,a collection probability of the terms occurring in the collection toaccount for sparseness of a term in the collection, and a translationprobability that a term of the queried question is a translation of aterm of a question; and generating a probability that the queriedquestion is from a language model of the question using a weightedcombination of the calculated topic probability and the calculated focusprobability of the question.
 12. The computer-readable storage medium ofclaim 11 wherein the calculated topic probability is a weighted linearcombination of an estimated calculated topic probability and theprobability of the terms occurring the collection.
 13. Thecomputer-readable storage medium of claim 11 wherein each question isrepresented by a term chain within the question tree, the topic of aquestion comprises the terms before the cut of the term chain, and thefocus of a question comprises the terms after the cut of the term chain.14. The computer-readable storage medium of claim 11 wherein thetranslation probability is generated from a collection of questions withassociated descriptions of each collection.
 15. A computing device fordetermining the relevance of questions related to a queried question,comprising: a data store storing a collection of questions, eachquestion having a topic of one or more terms and a focus of one or moreterms; a memory storing computer-executable instructions of: a firstcomponent that receives a queried question having terms; a secondcomponent that identifies a queried topic and a queried focus of thequeried question; and a third component that, for each of a plurality ofquestions of the collection, generates a score indicating the relevanceof the question to the queried question using a language model of thetopic of the question and a language model of the focus of the question;and a processor that executes the computer-executable instructionsstored in the memory.
 16. The computing device of claim 15 wherein eachquestion in the collection has an associated answer and wherein acomponent selects as answers to the queried question answers to thequestions with the highest generated scores.
 17. The computing device ofclaim 15 wherein a fourth component submits a question with a high scoreto a search engine and wherein the search results of the search enginecorrespond to search results for the queried question.
 18. The computingdevice of claim 15 wherein the topics and focuses of the questions ofthe collection are identified by a fourth component that generates aquestion tree of the questions of the collection and generating a cut ofthe question tree.
 19. The computing device of claim 15 wherein thethird component that generates the scores factors in a probability ofthe terms occurring in the collection to account for sparseness of aterm in the collection.
 20. The computing device of claim 15 wherein thethird component that generates the scores factors in a translationprobability that a term of the queried question is a translation of aterm of a question.